Monotone AC-Tree Automata
نویسندگان
چکیده
We consider several questions about monotone AC-tree automata, a class of equational tree automata [21] whose transition rules correspond to rules in Kuroda normal form of context-sensitive grammars. Whereas it is known that this class has a decision procedure to determine if a given monotone AC-tree automaton accepts no term [23], other decidability and complexity results have not been well-investigated yet. In the paper, we prove that the membership problem for monotone AC-tree automata is PSPACE-complete. We then study the expressiveness of monotone AC-tree automata: precisely, we prove that the family of AC-regular tree languages is strictly subsumed in that of AC-monotone tree languages. This result immediately yields the answers to two open problems, specially that the family of monotone AC-tree languages is not closed under complementation, and that the inclusion problem for monotone AC-tree automata is undecidable.
منابع مشابه
Tree Automata for Non-linear Arithmetic
Tree automata modulo associativity and commutativity axioms, called AC tree automata, accept trees by iterating the transition modulo equational reasoning. The class of languages accepted by monotone AC tree automata is known to include the solution set of the inequality x × y > z, which implies that the class properly includes the AC closure of regular tree languages. In the paper, we characte...
متن کاملA Tree Automata Theory for Uni cation Modulo Equational Rewriting
An extension of tree automata framework, called equational tree automata, is presented. This theory is useful to deal with uni cation modulo equational rewriting. In the manuscript, we demonstrate how equational tree automata can be applied to uni cation problems. 1 Equational Tree Languages Uni cation modulo equational theory is a central topic in automated reasoning. Tree automata are the pow...
متن کاملEquational Tree Automata: Towards Automated Verification of Network Protocols
An extension of tree automata framework, called equational tree automata, is presented. This theory is useful to deal with unification modulo equational rewriting. In the manuscript, we demonstrate how equational tree automata can be applied to several realistic unification examples, e.g. including a security problem of network protocols. 1 Equational Tree Languages Unification modulo equationa...
متن کاملDecidability and Closure Properties of Equational Tree Languages
Equational tree automata provide a powerful tree language framework that facilitates to recognize congruence closures of tree languages. In the paper we show the emptiness problem for AC-tree automata and the intersection-emptiness problem for regular AC-tree automata, each of which was open in our previous work [20], are decidable, by a straightforward reduction to the reachability problem for...
متن کاملParity Games and Automata for Game Logic (Extended Version)
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کامل